Merging Scenarios
نویسندگان
چکیده
Scenario languages define typical executions of systems. They are used to represent output traces, but also to capture requirements of distributed systems. Even if several dialects exist, all scenario languages are based on a similar idea: they depict systems runs as compositions of partially ordered sets of events. A drawback of scenarios is that the number of participants in a given interaction cannot be parameterized. With a fixed number of objects in an interaction, it is hard to describe behaviors of systems with dynamic architecture. Message Sequence Charts propose instance creation, but this mechanism needs to know a priori the name of instances that will be created. Another drawback of scenarios is that a description of a system is usually defined by a set of scenarios, which represent typical uses of the system under design in a given situation, but comport some redundancies. The intended behavior of a system can be seen as a combination of all these views. So far, no satisfactory merge operator exists. Scenario languages are all equipped with alternative, sequential, or parallel composition, but these operators do not capture the notion of redundancy that may exist between the composed views. A solution proposed is to gather coherently redundant views given as Live Sequence charts [8]. The main idea is to combine scenarios at runtime. LSCs are executed in parallel, and events that can be executed in several views are synchronized when possible. From an initial set of live scenarios, an event is executed, and new scenarios are “triggered” by this event execution. Two scenarios are declared inconsistent if they contradict each other on the order of common events. The main drawback of this approach is that inconsistency between scenarios may not be discovered if the simulations performed do not pass through a faulty configuration. This paper addresses a second approach that consists in the construction of a new model, preferably using the same scenario language, which is the smallest model to contain all the
منابع مشابه
Belief Merging using Partial Satisfactibility: cases studies
Merging operators aim at defining the beliefs or goals of a group of agents from the beliefs or goals of each member of the group. Several model-based propositional belief merging operators have been proposed which use propositional satisfaction. In this paper we introduce the notion of partial satisfactibility which is an alternative way of measure the satisfaction of a formula since this noti...
متن کاملTowards Semantic-based RSS Merging
Merging information can be of key importance in several XML-based applications. For instance, merging the RSS news from different sources and providers can be beneficial for end-users (journalists, economists, etc.) in various scenarios. In this work, we address this issue and mainly explore the relatedness relationships between RSS entities/elements. To validate our approach, we also provide a...
متن کاملTowards a Benchmark for Ontology Merging
Benchmarking approaches for ontology merging is challenging and has received little attention so far. A key problem is that there is in general no single best solution for a merge task and that merging may either be performed symmetrically or asymmetrically. As a first step to evaluate the quality of ontology merging solutions we propose the use of general metrics such as the relative coverage ...
متن کاملA Comparison of ATM Stream Merging Techniques
Multi-layer forwarding (a.k.a. multi-layer switching or routing) approaches, using ATM as transport technology have proven not to be sufficiently scaleable, if route aggregation is not performed. In ATM networks route aggregation means stream merging, that is cells from different incoming streams to be switched to the same outgoing link using the same stream identifier. This identifier could be...
متن کاملPlan Merging & Plan Reuse as Satisfiability
Planning as satissability has hitherto focused only on purely generative planning. There is an evidence in traditional reenement planning that planning incrementally by reusing or merging plans can be more eecient than planning from scratch (sometimes reuse is not eecient, but becomes necessary if the cost of abandoning the reusable plan is too high, when users are charged for the planning solu...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 133 شماره
صفحات -
تاریخ انتشار 2005